Skip to content

Implemented algorithms for finding the dimension of a given poset (exact and heuristic based) - #4

Open
LeoEnglert wants to merge 4 commits into
domduerr:mainfrom
LeoEnglert:main
Open

Implemented algorithms for finding the dimension of a given poset (exact and heuristic based)#4
LeoEnglert wants to merge 4 commits into
domduerr:mainfrom
LeoEnglert:main

Conversation

@LeoEnglert

@LeoEnglert LeoEnglert commented May 30, 2026

Copy link
Copy Markdown

Implemented algorithms for finding the dimension of a given poset, that can be used within odin now:

  • SAT-Algorithm (exact): Uses a SAT Solver for finding the dimension
  • Hypergraph-Coloring (exact): Uses Trotters Method for finding the dimension
  • Graph-Coloring (exact): Uses Yáñez & Montero algorithm for finding the dimension by using a form of graph coloring
  • Graph-Coloring-Heuristic (upper bound): Same Algorithm as the Graph-Coloring Algorithm but it uses DSATUR heuristic for finding an upper bound of the dimension
  • Hybrid (exact): Computes the dimension using DSatur-guided backtracking with selective hypergraph pruning.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant